Speedups of deterministic machines by synchronous parallel machines
نویسندگان
چکیده
منابع مشابه
A Taxonomy of Synchronous Parallel Machines
A new classificational scheme is presented which Perhaps the most important result derived from the is consistent wish Flynn's taxonomy but is more exprestaxonomy concerns the property of 'synchroneity". The sive. The crucial idea is to recognize that a reference author and apparently many other researchers have treated stream is composed of both values and addresses; their synchroneity as a pr...
متن کاملFast deterministic sorting on large parallel machines
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper, we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input di...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملFast Deterministic Simulation of Computations on Faulty Parallel Machines
A method of deterministic simulation of fully operational parallel machines on the analogous machines prone to errors is developed. The simulation is presented for the exclusive-read exclusive-write (EREW) PRAM and the Optical Communication Parallel Computer (OCPC), but it applies to a large class of parallel computers. It is shown that simulations of operational multiprocessor machines on faul...
متن کاملA Logic for Non-deterministic Parallel Abstract State Machines
We develop a logic which enables reasoning about single steps of non-deterministic parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and Stärk for reasoning about hierarchical (parallel) ASMs. Our main contribution to this regard is the handling of non-determinism (both bounded and unbounded) within the logical formalism. Moreover, we do thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1985
ISSN: 0022-0000
DOI: 10.1016/0022-0000(85)90011-x